1711A - Perfect Permutation - CodeForces Solution


constructive algorithms

Please click on ads to support us..

Python Code:

t=int(input())
for _ in range(t):
    n=int(input())
    if n%2==0:
        i=1
        while(i<=n):
            print(i+1,end=" ")
            print(i,end=" ")
            i+=2
    else:
        print(1,end=" ")
        i=2
        while(i<=n):
            print(i+1,end=" ")
            print(i,end=" ")
            i+=2
    print()
        
            
        

        
                
        
        
    

C++ Code:

#include<bits/stdc++.h>
using namespace std;

#define int long long int
int32_t main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		int a[n+1];
		for(int i=1;i<n+1;++i){
			a[i]=i;
		}
		for(int i=1;i<n+1;++i){
			if(n%2==0){
			if(i%2!=0){
				swap(a[i],a[i+1]);
			}}
			else{
			if(i%2==0 && i!=1){
				swap(a[i],a[i+1]);
			}}
		}
		for(int i=1;i<n+1;++i){
			cout<<a[i]<<" ";
		}cout<<endl;
	}
}


Comments

Submit
0 Comments
More Questions

796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation